منابع مشابه
Poset representation and similarity comparisons os systems in IR
In this paper we are using the poset representation to describe the complex answers given by IR systems after a clustering and ranking processes. The answers considered may be given by cartographical representations or by thematic sub-lists of documents. The poset representation, with the graph theory and the relational representation opens many perspectives in the definition of new similarity ...
متن کاملPoset representation and similarity comparisons of systems in IR
Abstract. In this paper we are using the poset representation to describe the complex answers given by IR systems after a clustering and ranking processes. The answers considered may be given by cartographical representations or by thematic sub-lists of documents. The poset representation, with the graph theory and the relational representation opens many perspectives in the definition of new s...
متن کاملOn Poset Merging∗
We consider the follow poset merging problem: Let X and Y be two subsets of a partially ordered set S. Given complete information about the ordering within both X and Y , how many comparisons are needed to determine the order on X ∪ Y ? This problem is a natural generalization of the list merging problem. While searching in partially ordered sets and sorting partially ordered sets have been con...
متن کاملOn Poset Sandwich Problems
A graph Gs = (V,Es) is a sandwich for a pair of graph Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in seriesparallel and interval po...
متن کاملOn Poset Boolean Algebras
Let 〈P,≤〉 be a partially ordered set. We define the poset Boolean algebra of P , and denote it by F (P ). The set of generators of F (P ) is {xp : p ∈ P}, and the set of relations is {xp ·xq = xp : p ≤ q}. We say that a Boolean algebra B is well-generated, if B has a sublattice G such that G generates B and 〈G,≤G〉 is well-founded. A wellgenerated algebra is superatomic. Theorem 1 Let 〈P,≤〉 be a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00401-x